0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.35	% Computer   : n014.cluster.edu
0.15/0.35	% Model      : x86_64 x86_64
0.15/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory     : 8042.1875MB
0.15/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 12:17:49 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.36	# Version: 2.6rc1-ho
0.15/0.37	# No SInE strategy applied
0.15/0.37	# Trying AutoSched0 for 59 seconds
59.17/59.38	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
59.17/59.38	# and selection function SelectCQIPrecWNTNp.
59.17/59.38	#
59.17/59.38	# Preprocessing time       : 0.055 s
59.17/59.38	# Presaturation interreduction done
59.17/59.42	# No success with AutoSched0
59.17/59.42	# Trying AutoSched1 for 26 seconds
60.72/60.91	# AutoSched1-Mode selected heuristic G_E___211_C18_F1_AE_CS_SP_S0Y
60.72/60.91	# and selection function SelectMaxLComplexAvoidPosPred.
60.72/60.91	#
60.72/60.91	# Preprocessing time       : 0.054 s
60.72/60.91	
60.72/60.91	# Proof found!
60.72/60.91	# SZS status Theorem
60.72/60.91	# SZS output start CNFRefutation
60.72/60.91	thf(fact_29_less__trans__Suc, axiom, ![X19:nat, X22:nat, X1:nat]:((ord_less_nat @ (suc @ X19) @ X1<=ord_less_nat @ X22 @ X1)<=ord_less_nat @ X19 @ X22), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_29_less__trans__Suc)).
60.72/60.91	thf(fact_41_Suc__lessD, axiom, ![X6:nat, X7:nat]:(ord_less_nat @ (suc @ X6) @ X7=>ord_less_nat @ X6 @ X7), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_41_Suc__lessD)).
60.72/60.91	thf(fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062, axiom, ord_less_nat @ nMsg @ (size_s1406904903t_unit @ (fe @ index)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062)).
60.72/60.91	thf(conj_0, conjecture, ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
60.72/60.91	thf(fact_54_linorder__neqE__nat, axiom, ![X37:nat, X47:nat]:((~(ord_less_nat @ X37 @ X47)=>ord_less_nat @ X47 @ X37)<=(X37)!=(X47)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_54_linorder__neqE__nat)).
60.72/60.91	thf(fact_0_AssumpGreaterOccurrence_I1_J, axiom, ~(ord_less_nat @ nMsg @ n1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_AssumpGreaterOccurrence_I1_J)).
60.72/60.91	thf(c_0_6, plain, ![X19:nat, X22:nat, X1:nat]:(ord_less_nat @ X19 @ X22=>(ord_less_nat @ X22 @ X1=>ord_less_nat @ (suc @ X19) @ X1)), inference(fof_simplification,[status(thm)],[fact_29_less__trans__Suc])).
60.72/60.91	thf(c_0_7, plain, ![X879:nat, X880:nat, X881:nat]:(~ord_less_nat @ X879 @ X880|(~ord_less_nat @ X880 @ X881|ord_less_nat @ (suc @ X879) @ X881)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
60.72/60.91	thf(c_0_8, plain, ![X1069:nat, X1070:nat]:(~ord_less_nat @ (suc @ X1069) @ X1070|ord_less_nat @ X1069 @ X1070), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_41_Suc__lessD])])).
60.72/60.91	thf(c_0_9, plain, ![X3:nat, X1:nat, X6:nat]:(ord_less_nat @ (suc @ X1) @ X6|~ord_less_nat @ X1 @ X3|~ord_less_nat @ X3 @ X6), inference(split_conjunct,[status(thm)],[c_0_7])).
60.72/60.91	thf(c_0_10, plain, ord_less_nat @ nMsg @ (size_s1406904903t_unit @ (fe @ index)), inference(split_conjunct,[status(thm)],[fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062])).
60.72/60.91	thf(c_0_11, negated_conjecture, ~ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
60.72/60.91	thf(c_0_12, plain, ![X1:nat, X3:nat]:(ord_less_nat @ X1 @ X3|~ord_less_nat @ (suc @ X1) @ X3), inference(split_conjunct,[status(thm)],[c_0_8])).
60.72/60.91	thf(c_0_13, plain, ![X1:nat]:(ord_less_nat @ (suc @ X1) @ (size_s1406904903t_unit @ (fe @ index))|~ord_less_nat @ X1 @ nMsg), inference(spm,[status(thm)],[c_0_9, c_0_10])).
60.72/60.91	thf(c_0_14, plain, ![X37:nat, X47:nat]:((X37)!=(X47)=>(~ord_less_nat @ X37 @ X47=>ord_less_nat @ X47 @ X37)), inference(fof_simplification,[status(thm)],[fact_54_linorder__neqE__nat])).
60.72/60.91	thf(c_0_15, negated_conjecture, ~ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index)), inference(split_conjunct,[status(thm)],[c_0_11])).
60.72/60.91	thf(c_0_16, plain, ![X1:nat]:(ord_less_nat @ X1 @ (size_s1406904903t_unit @ (fe @ index))|~ord_less_nat @ X1 @ nMsg), inference(spm,[status(thm)],[c_0_12, c_0_13])).
60.72/60.91	thf(c_0_17, plain, ![X1123:nat, X1124:nat]:((X1123)=(X1124)|(ord_less_nat @ X1123 @ X1124|ord_less_nat @ X1124 @ X1123)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])).
60.72/60.91	thf(c_0_18, plain, ~ord_less_nat @ nMsg @ n1, inference(fof_simplification,[status(thm)],[fact_0_AssumpGreaterOccurrence_I1_J])).
60.72/60.91	thf(c_0_19, negated_conjecture, ~ord_less_nat @ n1 @ nMsg, inference(spm,[status(thm)],[c_0_15, c_0_16])).
60.72/60.91	thf(c_0_20, plain, ![X3:nat, X1:nat]:((X1)=(X3)|ord_less_nat @ X1 @ X3|ord_less_nat @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_17])).
60.72/60.91	thf(c_0_21, plain, ~ord_less_nat @ nMsg @ n1, inference(split_conjunct,[status(thm)],[c_0_18])).
60.72/60.91	thf(c_0_22, negated_conjecture, (n1)=(nMsg), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])).
60.72/60.91	thf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_22]), c_0_10])]), ['proof']).
60.72/60.91	# SZS output end CNFRefutation
60.72/60.91	# Proof object total steps             : 24
60.72/60.91	# Proof object clause steps            : 11
60.72/60.91	# Proof object formula steps           : 13
60.72/60.91	# Proof object conjectures             : 6
60.72/60.91	# Proof object clause conjectures      : 4
60.72/60.91	# Proof object formula conjectures     : 2
60.72/60.91	# Proof object initial clauses used    : 6
60.72/60.91	# Proof object initial formulas used   : 6
60.72/60.91	# Proof object generating inferences   : 4
60.72/60.91	# Proof object simplifying inferences  : 4
60.72/60.91	# Training examples: 0 positive, 0 negative
60.72/60.91	# Parsed axioms                        : 309
60.72/60.91	# Removed by relevancy pruning/SinE    : 0
60.72/60.91	# Initial clauses                      : 487
60.72/60.91	# Removed in clause preprocessing      : 63
60.72/60.91	# Initial clauses in saturation        : 424
60.72/60.91	# Processed clauses                    : 12792
60.72/60.91	# ...of these trivial                  : 270
60.72/60.91	# ...subsumed                          : 9660
60.72/60.91	# ...remaining for further processing  : 2862
60.72/60.91	# Other redundant clauses eliminated   : 507
60.72/60.91	# Clauses deleted for lack of memory   : 0
60.72/60.91	# Backward-subsumed                    : 101
60.72/60.91	# Backward-rewritten                   : 200
60.72/60.91	# Generated clauses                    : 153620
60.72/60.91	# ...of the previous two non-trivial   : 145362
60.72/60.91	# Contextual simplify-reflections      : 96
60.72/60.91	# Paramodulations                      : 152578
60.72/60.91	# Factorizations                       : 14
60.72/60.91	# NegExts                              : 2
60.72/60.91	# Equation resolutions                 : 605
60.72/60.91	# Propositional unsat checks           : 0
60.72/60.91	#    Propositional check models        : 0
60.72/60.91	#    Propositional check unsatisfiable : 0
60.72/60.91	#    Propositional clauses             : 0
60.72/60.91	#    Propositional clauses after purity: 0
60.72/60.91	#    Propositional unsat core size     : 0
60.72/60.91	#    Propositional preprocessing time  : 0.000
60.72/60.91	#    Propositional encoding time       : 0.000
60.72/60.91	#    Propositional solver time         : 0.000
60.72/60.91	#    Success case prop preproc time    : 0.000
60.72/60.91	#    Success case prop encoding time   : 0.000
60.72/60.91	#    Success case prop solver time     : 0.000
60.72/60.91	# Current number of processed clauses  : 2546
60.72/60.91	#    Positive orientable unit clauses  : 147
60.72/60.91	#    Positive unorientable unit clauses: 1
60.72/60.91	#    Negative unit clauses             : 437
60.72/60.91	#    Non-unit-clauses                  : 1961
60.72/60.91	# Current number of unprocessed clauses: 132450
60.72/60.91	# ...number of literals in the above   : 456375
60.72/60.91	# Current number of archived formulas  : 0
60.72/60.91	# Current number of archived clauses   : 305
60.72/60.91	# Clause-clause subsumption calls (NU) : 407941
60.72/60.91	# Rec. Clause-clause subsumption calls : 290978
60.72/60.91	# Non-unit clause-clause subsumptions  : 2626
60.72/60.91	# Unit Clause-clause subsumption calls : 31869
60.72/60.91	# Rewrite failures with RHS unbound    : 0
60.72/60.91	# BW rewrite match attempts            : 123
60.72/60.91	# BW rewrite match successes           : 48
60.72/60.91	# Condensation attempts                : 0
60.72/60.91	# Condensation successes               : 0
60.72/60.91	# Termbank termtop insertions          : 1847472
60.72/60.92	
60.72/60.92	# -------------------------------------------------
60.72/60.92	# User time                : 59.449 s
60.72/60.92	# System time              : 1.099 s
60.72/60.92	# Total time               : 60.548 s
60.72/60.92	# Maximum resident set size: 2120 pages
60.72/60.92	EOF